Finding small stabilizers for unstable graphs
نویسندگان
چکیده
منابع مشابه
Finding Small Stabilizers for Unstable Graphs
An undirected graph G = (V,E) is stable if its inessential vertices (those that are exposed by at least one maximum matching) form a stable set. We call a set of edges F ⊆ E a stabilizer if its removal from G yields a stable graph. In this paper we study the following natural edgedeletion question: given a graph G = (V,E), can we find a minimumcardinality stabilizer? Stable graphs play an impor...
متن کاملFinding small stabilizers for unstable graphs
In an instance of the classical, cooperative matching game introduced by Shapley and Shubik [Int. J. Game Theory ’71] we are given an undirected graph G = (V,E), and we define the value ν(S) of each subset S ⊆ V as the cardinality of a maximum matching in the subgraph G[S] induced by S. The core of such a game contains all fair allocations of ν(V ) among the players of V , and is well-known to ...
متن کاملAdditive Stabilizers for Unstable Graphs
Stabilization of graphs has received substantial attention in recent years due to its connection to game theory. Stable graphs are exactly the graphs inducing a matching game with non-empty core. They are also the graphs that induce a network bargaining game with a balanced solution. A graph with weighted edges is called stable if the maximum weight of an integral matching equals the cost of a ...
متن کاملNon-Smooth Stabilizers for Nonlinear Systems with Uncontrollable Unstable Linearization
We prove that every chain of odd power integrators perturbed by a C triangular vector eld can be stabilized in the large via continuous state feedback, although it is not stabilizable, even locally, by any smooth state feedback. The proof is constructive and accomplished by developing a machinery|a continuous type of adding a power integrator|that enables one to explicitly design a C globally s...
متن کاملFinding Smooth Graphs with Small Independence Numbers
In this paper we formulate an algorithm for finding smooth graphs with small independence numbers. To this end we formalize a family of satisfaction problems and propose a branch-and-bound-based approach for solving them. Strong bounds are obtained by exploiting graph-theoretic aspects including new results obtained in cooperation with leading graph theorists. Based on a partial solution we der...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2014
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-014-0854-1